Projective Reed - Muller Codes
نویسنده
چکیده
R~sum~. On inlroduit une classe de codes lintaires de la famille des codes de Reed-Muller, les codes de Reed-Muller projectifs. Ces codes sont des extensions des codes de Reed-Muller gtntralists ; les codes de Reed-Muller projectifs d'ordre I atteignent la borne de Plotkin. On donne les traram&res des codes de Reed-Muller projecfifs d'ordre 2. 1.Introduction We note pm(Fq) the projective space of dimension m over the finite field Fq with q elements, so that # pm(Fq) = qm + qm-l+ ... + 1. We consider the following data : a) a finite dimensional vector space L over Fq ; b) for every point x of a subset V c pm(Fq), an evaluation map q~x : L-~ Fq which is a linear form and associates to every f ~ L an element q~x(f) ~ Fq. With these data, we define the code C L c Fq #v as the image of the map • from L to Fq #V defined by ~(f) = (q~x(f))xeV. The geometric codes are constructed in this way (cf. [8], § 3.1). As a particular case, we can take for L certain finite dimensional spaces of rational functions on a smooth curve X, and define, for a point x of X def'med over Fq which is not a pole of the members of L the
منابع مشابه
Projective Segre codes
Let K = Fq be a finite field. We introduce a family of projective Reed-Mullertype codes called projective Segre codes. Then we study their basic parameters and show that they are direct products of projective Reed-Muller-type codes. It turns out that the direct product of two projective Reed-Muller-type codes is again a projective Reed-Muller-type code. As a consequence we recover some results ...
متن کاملDirect products in projective Segre codes
Let K = Fq be a finite field. We introduce a family of projective Reed-Muller-type codes called projective Segre codes. Using commutative algebra and linear algebra methods, we study their basic parameters and show that they are direct products of projective Reed-Mullertype codes. As a consequence we recover some results on projective Reed-Muller-type codes over the Segre variety and over proje...
متن کاملRemarks on low weight codewords of generalized affine and projective Reed-Muller codes
A brief survey on low weight codewords of generalized Reed-Muller codes and projective generalized Reed-Muller codes is presented. In the affine case some information about the words that reach the second distance is given. Moreover the second weight of the projective Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
متن کاملOn Low Weight Codewords of Generalized Affine and Projective Reed - Muller Codes ( Extended abstract )
We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we give some results on codewords that cannot reach the second weight also called the next to minimal distance. In the projective case the second distance of generalized Reed-Muller codes is estimated, namely a lower bound and an upper bound of this weight are given.
متن کاملOn low weight codewords of generalized affine and projective Reed-Muller codes
We propose new results on low weight codewords of affine and projective generalized Reed-Muller codes. In the affine case we prove that if the size of the working finite field is large compared to the degree of the code, the low weight codewords are products of affine functions. Then in the general case we study some types of codewords and prove that they cannot be second, thirds or fourth weig...
متن کاملRelative Reed-muller Codes on Projective Bundles
— We consider linear codes defined by the projective bundle associated to a vector bundle over a curve. We prove the existence of codes with explicit parameters. Résumé (Codes de Reed-Muller relatifs sur des fibrés projectifs). — Nous étudions les codes linéaires définis par le fibré projectif associé à un fibré vectoriel sur une courbe. Nous prouvons l’existence de codes avec des paramètres ex...
متن کامل